Binary Convolutional Codes of High Rate
نویسنده
چکیده
The function N(r; ; dfree), defined as the maximum n such that there exists a binary convolutional code of block length n, dimension n r, constraint length , and free distance dfree, is studied. For dfree 2 f3; 4g, codes are obtained from simple constructions that determine N(r; ; dfree) for all positive integers and r. Codes with minimum Hamming distance dfree 5 are found by computer search. A number of new codes, with specified constraint lengths, redundancies, and free distances, and higher code rates than previously reported codes, are presented.
منابع مشابه
Design and Performance of Rate-Compatible Non-binary LDPC Convolutional Codes
In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felström and Zigangirov construction [1] for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary convolutional code is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-reg...
متن کاملTerminated LDPC Convolutional Codes over GF(2)
In this paper, we present a construction method of terminated non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an expansion of Felstrom and Zigangirov construction [1] for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary LDPC convolutional codes is also discussed. The proposed ratecompatible code is designed from one single ...
متن کاملHigh Rate Binary Coset Code Used for Inner Code
High rate binary coset codes are investigated. The binary coset(BC) code is a binary convolutional code with parallel path. In our previous research of concatenated trelliscoded modulation(TCM) scheme, we have found that the e ective minimum distance of inner code is more important than the minimum free distance when TCM is used as inner code. In this paper, for inner code, we construct the hig...
متن کاملIterative decoding of binary block and convolutional codes
Iterative decoding of two-dimensional systematic convolutional codes has been termed “turbo” (de)coding. Using log-likelihood algebra, we show that any decoder can he used which accepts soft inputs-including a priori values-and delivers soft outputs that can he split into three terms: the soft channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a priori value...
متن کاملIterative Decoding of Binary Block and Convolutional Codes - Information Theory, IEEE Transactions on
AbstructIterative decoding of two-dimensional systematic convolutional codes has been termed “turbo” (de)coding. Using log-likelihood algebra, we show that any decoder can be used which accepts soft inputs-including a priori values-and delivers soft outputs that can be split into three terms: the soft channel and a priori inputs, and the extrinsic value. The extrinsic value is used as an a prio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003